Declarative Implementations of Search Strategies for Solving CSPs in Control Network Programming
نویسنده
چکیده
The paper describes one of the most researched techniques in solving Constraint Satisfaction Problems (CSPs) searching which is well-suited for declarative (non-procedural) implementation in a new programming paradigm named Control Network Programming, and how this can be achieved using the tools for dynamic computation control. Some heuristics for variable and value ordering in backtracking algorithm, lookahead strategies, stochastic strategies and local search strategies are subjects of interest. The 8-queens problem is used to help in illustrating how these algorithms work, and how they can be implemented in Control Network Programming. Key-Words: Control Network Programming; graphical programming; declarative programming; Constraint Satisfaction Problem; MRV, degree, LCV and minimum-conflicts heuristics.
منابع مشابه
A Theoretical Framework for Consistency Techniques in Logic Programming
While being a powerful paradigm for solving Constraint Satisfaction Problems (CSPs), Consistency Techniques (CTs) have never been taken into account during the design of declarative programming languages. This paper defines a theoretical framework for using CTs inside logic programming. Three inference rules are introduced and their formal properties are investigated. Also, computation rules ar...
متن کاملSolving a Multi-Item Supply Chain Network Problem by Three Meta-heuristic Algorithms
The supply chain network design not only assists organizations production process (e.g.,plan, control and execute a product’s flow) but also ensure what is the growing need for companies in a longterm. This paper develops a three-echelon supply chain network problem including multiple plants, multiple distributors, and multiple retailers with amulti-mode demand satisfaction policy inside of pro...
متن کاملA Combined Stochastic Programming and Robust Optimization Approach for Location-Routing Problem and Solving it via Variable Neighborhood Search algorithm
The location-routing problem is one of the combined problems in the area of supply chain management that simultaneously make decisions related to location of depots and routing of the vehicles. In this paper, the single-depot capacitated location-routing problem under uncertainty is presented. The problem aims to find the optimal location of a single depot and the routing of vehicles to serve th...
متن کاملA Cascadable Vlsi Design for Genet
Constraint Satisfaction Problems (CSPs) are at the heart of many AI applications. The currently existing constraint programming languages and systems are mostly based on heuristic search techniques. The major problems of these techniques are the limited parallelism available in the algorithms and the inadequacy of handling over-constrained CSPs. GENET is a competitive neural network model devel...
متن کاملA conic quadratic model for supply chain network design under hub, capacity, delay and lost sale
In this paper, mathematical models are proposed for simultaneously modeling location and inventory control decisions in a four echelon supply chain network considering capacity. The echelons considered in this paper include suppliers, warehouses, hubs and retailers. The aim of the model is to minimize the location, transportation and inventory control costs. Hence, a non-linear mixed integer pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013